A Greedy Double Auction Mechanism for Grid Resource Allocation
نویسندگان
چکیده
To improve the resource utilization and satisfy more users, a Greedy Double Auction Mechanism(GDAM) is proposed to allocate resources in grid environments. GDAM trades resources at discriminatory price instead of uniform price, reflecting the variance in requirements for profits and quantities. Moreover, GDAM applies different auction rules to different cases, over-demand, over-supply and equilibrium of demand and supply. As a new mechanism for grid resource allocation, GDAM is proved to be strategy-proof, economically efficient, weakly budgetbalanced and individual rational. Simulation results also confirm that GDAM outperforms the traditional one on both the total trade amount and the user satisfaction percentage, specially as more users are involved in the auction market.
منابع مشابه
A Double Auction Mechanism for Resource Allocation on Grid Computing Systems
Considering dynamic, heterogeneous and autonomous characteristics of computing resources in grid computing systems and the flexibility and effectivity of economics methods applied to solve the problem of resource management, a double auction mechanism for resource allocation on grid computing systems is presented. Firstly, a market model of double auction is described, in which agents are utili...
متن کاملCombinatorial Double Auction-based Scheme for Resource Allocation in Grids
Offering Grid services in an open market determines an optimization case for finding the best suitable resource allocation for a given number of requests and existing resources. Thus, appropriate resource allocation schemes, supporting accounting, are required in addition to a pricing scheme, which supports financial fairness criteria. The newly developed Resource Allocation Model Developed for...
متن کاملAuction Resource Allocation Mechanisms in Grids of Heterogeneous Computers
This paper examines economic resource allocation through a number of auction types for a grid of ewaste computers. It examines the time to complete tasks and the energy usage of completing the tasks on a grid. A model of a simulated grid is developed and used to evaluate the resource allocation mechanisms. The model is an agent-based simulation where by user agents submit tasks to node agents t...
متن کاملOptimization Heuristics for the Combinatorial Auction Problem
This paper presents and compares three heuristics for the combinatorial auction problem. Besides a simple greedy (SG) mechanism, two metaheuristics, a simulated annealing (SA), and a genetic algorithm (GA) approach are developed which use the combinatorial auction process to find an allocation with maximal revenue for the auctioneer. The performance of these three heuristics is evaluated in the...
متن کاملMulti-Attribute Double Auction Models for Resource Allocation in Computational Grids
In this paper we propose the double auction allocation models for computational grids, and two double auction algorithms for resource allocation: Single Price Double Auction algorithm (SPDA), and Multiple Attribute Double Auction algorithm (MADA). The fairness and comprehensive performance are introduced into the traditional double auction models to evaluate impact of price, speed and storage o...
متن کامل